#include <iostream>
#include "BinaryTree.h"

using namespace std;

int main() {

	TreeNode<char> jia('+');
	TreeNode<char> jian('-');
	TreeNode<char> e('E');
	jia.left = &jian;
	jia.right = &e;
	TreeNode<char> cheng('*');
	TreeNode<char> d('D');
	jian.left = &cheng;
	jian.right = &d;
	TreeNode<char> chu('/');
	TreeNode<char> c('C');
	cheng.left = &chu;
	cheng.right = &c;
	TreeNode<char> a('A');
	TreeNode<char> b('B');
	chu.left = &a;
	chu.right = &b;

	BinaryTree<char> test;
	test.root = &jia;
	test.InOrder();
	cout << endl;
	test.PreOrder();
	cout << endl;
	test.PostOrder();
	cout << endl;
	test.LevelOrder();
	cout << endl;
	system("pause");
	return 0;
}